From Hypocomputation to Hypercomputation
نویسنده
چکیده
Hypercomputational formal theories will, clearly, be both structurally and foundationally different from the formal theories underpinning computational theories. However, many of the maps that might guide us into this strange realm have been lost. So little work has been done recently in the area of metamathematics, and so many of the previous results have been folded into other theories, that we are in danger of loosing an appreciation of the broader structure of formal theories. As an aid to those looking to develop hypercomputational theories, we will briefly survey the known landmarks both inside and outside the borders of computational theory. We will not focus in this paper on why the structure of formal theory looks the way it does. Instead we will focus on what this structure looks like, moving from hypocomputational, through traditional computational theories, and then beyond to hypercomputational theories.
منابع مشابه
The case for hypercomputation
The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspected to have super-Turing or hypercomputational capabilities, and argue that there is nothing in principle to prevent the physical implementation of hypercomputational systems. Hypercomputation may indeed be intrinsic to ...
متن کاملNon-Classical Hypercomputation
Hypercomputation that seeks to solve the Halting Problem, or to compute Turing-uncomputable numbers, might be called “classical” hypercomputation, as it moves beyond the classical Turing computational paradigm. There are further computational paradigms that we might seek to move beyond, forming the basis for a wider “non-classical” hypercomputation. This paper surveys those paradigms, and poses...
متن کاملSome Thoughts on Hypercomputation
Hypercomputation is a relatively new branch of computer science that emerged from the idea that the Church–Turing Thesis, which is supposed to describe what is computable and what is noncomputable, cannot possible be true. Because of its apparent validity, the Church–Turing Thesis has been used to investigate the possible limits of intelligence of any imaginable life form, and, consequently, th...
متن کاملOracle Turing machines faced with the verification problem
The main current issue about hypercomputation concern the following thesis: it is physically possible to build a hypercomputation model. To prove this thesis, one possible strategy could be to physically build an oracle Turing machine. More precisely, it is about finding a physical theory where a hypercomputation model will be able to use some external information from nature. Such an informati...
متن کاملHypercomputation: philosophical issues
A survey of the /eld of hypercomputation, including discussion of four a priori objections to the possibility of hypercomputation. An exegesis of Turing’s preand post-war writings on the mind is given, and Turing’s views on the scope of machines are discussed. c © 2003 Published by Elsevier B.V.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJUC
دوره 5 شماره
صفحات -
تاریخ انتشار 2009